Turing Universality of Neural Nets (Revisited)
نویسندگان
چکیده
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. We emphasize the modular construction of nets within nets, a relevant issue from the software engineering point of view.
منابع مشابه
Some Considerations on Universality
Without the investigation of the concept of universality it is quite possible that our modern computers wouldn’t exist. Although they are finite automata, at least theoretically, practically they can be treated as Turing machines processing any special program which can be seen as a special Turing machine. This paper presents some general considerations on that concept, presenting in some more ...
متن کاملSome Afterthoughts on Hoppeld Networks
The present paper investigates four relatively independent issues, each in one section, which complete our knowledge regarding the computational aspects of popular Hoppeld nets 9]. In Section 2, the computational equivalence of convergent asymmetric and Hoppeld nets is shown with respect to the network size. In Section 3, the convergence time of Hoppeld nets is analyzed in terms of bit represen...
متن کاملSome Afterthoughts on Hopfield Networks
The present paper investigates four relatively independent issues each in one section which complete our knowledge regarding the computational aspects of popular Hop eld nets In Section the computational equivalence of convergent asymmetric and Hop eld nets is proved with respect to the network size In Section the convergence time of Hop eld nets is analyzed in terms of bit representations In S...
متن کاملDeutsch's Universal Quantum Turing Machine (revisited)
Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. This interesting problem has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani. Quantum Turing...
متن کاملnt - p h / 07 01 10 8 v 1 1 6 Ja n 20 07 Deutsch ’ s Universal Quantum Turing Machine ( Revisited ) Willem Fouché ( Department of Decision Sciences
Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. This interesting problem has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani. Quantum Turing...
متن کامل